CombinatoricsWe generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants and pfaffians due to Kuperberg, as well as a determinant of Tsuchiya. The level of generality of our statements render their proofs easy and routine, by using Dodgson Condensation and/or Krattenthaler's factor exhaustion method
Olga Taussky-Todd suggested the problem of determining the possible values of integer circulant dete...
The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally relate...
AbstractThe Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturall...
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants a...
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants and...
AbstractUsing a recurrence derived from Dodgson's Condensation Method, we provide numerous explicit ...
AbstractA new evaluation of deti+j+x2i−j0⩽1,j⩽n−1 is provided. The method of proof is inspired by th...
5 pagesInternational audienceScott considered the determinant of 1/(y-z)^2, with y,z running over tw...
Abstract. We prove three conjectures concerning the evaluation of de-terminants, which are related t...
<F4.793e+05> We prove a new combinatorial characterization of the<F3.928e+05> determi-&...
Abstract. Zeilberger has given a combinatorial proof of Dodgson’s rule for calculating determinants....
The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally relate...
A variation of Zeilberger’s holonomic ansatz for symbolic de-terminant evaluations is proposed which...
The Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturally relate...
Since the late 1980s the author has published a number of results on matrix functions, which were ob...
Olga Taussky-Todd suggested the problem of determining the possible values of integer circulant dete...
The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally relate...
AbstractThe Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturall...
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants a...
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants and...
AbstractUsing a recurrence derived from Dodgson's Condensation Method, we provide numerous explicit ...
AbstractA new evaluation of deti+j+x2i−j0⩽1,j⩽n−1 is provided. The method of proof is inspired by th...
5 pagesInternational audienceScott considered the determinant of 1/(y-z)^2, with y,z running over tw...
Abstract. We prove three conjectures concerning the evaluation of de-terminants, which are related t...
<F4.793e+05> We prove a new combinatorial characterization of the<F3.928e+05> determi-&...
Abstract. Zeilberger has given a combinatorial proof of Dodgson’s rule for calculating determinants....
The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally relate...
A variation of Zeilberger’s holonomic ansatz for symbolic de-terminant evaluations is proposed which...
The Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturally relate...
Since the late 1980s the author has published a number of results on matrix functions, which were ob...
Olga Taussky-Todd suggested the problem of determining the possible values of integer circulant dete...
The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally relate...
AbstractThe Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturall...
DOI
Add to ORKG